TSTP Solution File: SET611^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET611^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:12:25 EDT 2024
% Result : Theorem 0.19s 0.37s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 59 ( 1 unt; 7 typ; 0 def)
% Number of atoms : 295 ( 79 equ; 0 cnn)
% Maximal formula atoms : 8 ( 5 avg)
% Number of connectives : 330 ( 69 ~; 71 |; 51 &; 131 @)
% ( 6 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 83 ( 60 ^ 16 !; 6 ?; 83 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_8,type,
sK0: a > $o ).
thf(func_def_9,type,
sK1: a > $o ).
thf(func_def_11,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
sK4: a ).
thf(func_def_13,type,
sK5: a ).
thf(f83,plain,
$false,
inference(avatar_sat_refutation,[],[f20,f21,f56,f82]) ).
thf(f82,plain,
( ~ spl2_1
| spl2_2 ),
inference(avatar_contradiction_clause,[],[f81]) ).
thf(f81,plain,
( $false
| ~ spl2_1
| spl2_2 ),
inference(trivial_inequality_removal,[],[f78]) ).
thf(f78,plain,
( ( $true = $false )
| ~ spl2_1
| spl2_2 ),
inference(superposition,[],[f70,f76]) ).
thf(f76,plain,
( ( ( sK0 @ sK5 )
= $false )
| ~ spl2_1
| spl2_2 ),
inference(trivial_inequality_removal,[],[f74]) ).
thf(f74,plain,
( ( $true = $false )
| ( ( sK0 @ sK5 )
= $false )
| ~ spl2_1
| spl2_2 ),
inference(superposition,[],[f72,f59]) ).
thf(f59,plain,
( ! [X1: a] :
( ( $false
= ( sK1 @ X1 ) )
| ( $false
= ( sK0 @ X1 ) ) )
| ~ spl2_1 ),
inference(binary_proxy_clausification,[],[f58]) ).
thf(f58,plain,
( ! [X1: a] :
( ( ( sK0 @ X1 )
& ( sK1 @ X1 ) )
= $false )
| ~ spl2_1 ),
inference(beta_eta_normalization,[],[f57]) ).
thf(f57,plain,
( ! [X1: a] :
( ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ X1 )
= ( ^ [Y0: a] : $false
@ X1 ) )
| ~ spl2_1 ),
inference(argument_congruence,[],[f15]) ).
thf(f15,plain,
( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f13]) ).
thf(f13,plain,
( spl2_1
<=> ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f72,plain,
( ( $true
= ( sK1 @ sK5 ) )
| spl2_2 ),
inference(trivial_inequality_removal,[],[f71]) ).
thf(f71,plain,
( ( $true = $false )
| ( $true
= ( sK1 @ sK5 ) )
| spl2_2 ),
inference(forward_demodulation,[],[f66,f70]) ).
thf(f66,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( $true
= ( sK1 @ sK5 ) )
| spl2_2 ),
inference(not_proxy_clausification,[],[f65]) ).
thf(f65,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( ~ ( sK1 @ sK5 ) )
= $false )
| spl2_2 ),
inference(duplicate_literal_removal,[],[f64]) ).
thf(f64,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( ( ~ ( sK1 @ sK5 ) )
= $false )
| ( ( sK0 @ sK5 )
= $false )
| spl2_2 ),
inference(binary_proxy_clausification,[],[f63]) ).
thf(f63,plain,
( ( ( sK0 @ sK5 )
= $false )
| ( $false
= ( ~ ( sK1 @ sK5 )
& ( sK0 @ sK5 ) ) )
| spl2_2 ),
inference(binary_proxy_clausification,[],[f61]) ).
thf(f61,plain,
( ( ( sK0 @ sK5 )
!= ( ~ ( sK1 @ sK5 )
& ( sK0 @ sK5 ) ) )
| spl2_2 ),
inference(beta_eta_normalization,[],[f60]) ).
thf(f60,plain,
( ( ( sK0 @ sK5 )
!= ( ^ [Y0: a] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ sK5 ) )
| spl2_2 ),
inference(negative_extensionality,[],[f18]) ).
thf(f18,plain,
( ( ( ^ [Y0: a] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= sK0 )
| spl2_2 ),
inference(avatar_component_clause,[],[f17]) ).
thf(f17,plain,
( spl2_2
<=> ( ( ^ [Y0: a] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= sK0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f70,plain,
( ( ( sK0 @ sK5 )
= $true )
| spl2_2 ),
inference(duplicate_literal_removal,[],[f67]) ).
thf(f67,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( ( sK0 @ sK5 )
= $true )
| spl2_2 ),
inference(binary_proxy_clausification,[],[f62]) ).
thf(f62,plain,
( ( ( sK0 @ sK5 )
= $true )
| ( $true
= ( ~ ( sK1 @ sK5 )
& ( sK0 @ sK5 ) ) )
| spl2_2 ),
inference(binary_proxy_clausification,[],[f61]) ).
thf(f56,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_contradiction_clause,[],[f55]) ).
thf(f55,plain,
( $false
| spl2_1
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f50]) ).
thf(f50,plain,
( ( $true = $false )
| spl2_1
| ~ spl2_2 ),
inference(superposition,[],[f25,f47]) ).
thf(f47,plain,
( ( ( sK0 @ sK4 )
= $false )
| spl2_1
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f44]) ).
thf(f44,plain,
( ( ( sK0 @ sK4 )
= $false )
| ( $true = $false )
| spl2_1
| ~ spl2_2 ),
inference(superposition,[],[f34,f24]) ).
thf(f24,plain,
( ( ( sK1 @ sK4 )
= $true )
| spl2_1 ),
inference(binary_proxy_clausification,[],[f23]) ).
thf(f23,plain,
( ( $false
!= ( ( sK0 @ sK4 )
& ( sK1 @ sK4 ) ) )
| spl2_1 ),
inference(beta_eta_normalization,[],[f22]) ).
thf(f22,plain,
( ( ( ^ [Y0: a] : $false
@ sK4 )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) )
@ sK4 ) )
| spl2_1 ),
inference(negative_extensionality,[],[f14]) ).
thf(f14,plain,
( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
| spl2_1 ),
inference(avatar_component_clause,[],[f13]) ).
thf(f34,plain,
( ! [X1: a] :
( ( $false
= ( sK1 @ X1 ) )
| ( $false
= ( sK0 @ X1 ) ) )
| ~ spl2_2 ),
inference(not_proxy_clausification,[],[f33]) ).
thf(f33,plain,
( ! [X1: a] :
( ( ( ~ ( sK1 @ X1 ) )
= $true )
| ( $false
= ( sK0 @ X1 ) ) )
| ~ spl2_2 ),
inference(binary_proxy_clausification,[],[f28]) ).
thf(f28,plain,
( ! [X1: a] :
( ( ( ~ ( sK1 @ X1 )
& ( sK0 @ X1 ) )
= $true )
| ( $false
= ( sK0 @ X1 ) ) )
| ~ spl2_2 ),
inference(binary_proxy_clausification,[],[f27]) ).
thf(f27,plain,
( ! [X1: a] :
( ( ~ ( sK1 @ X1 )
& ( sK0 @ X1 ) )
= ( sK0 @ X1 ) )
| ~ spl2_2 ),
inference(beta_eta_normalization,[],[f26]) ).
thf(f26,plain,
( ! [X1: a] :
( ( ^ [Y0: a] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) )
@ X1 )
= ( sK0 @ X1 ) )
| ~ spl2_2 ),
inference(argument_congruence,[],[f19]) ).
thf(f19,plain,
( ( ( ^ [Y0: a] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= sK0 )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f17]) ).
thf(f25,plain,
( ( ( sK0 @ sK4 )
= $true )
| spl2_1 ),
inference(binary_proxy_clausification,[],[f23]) ).
thf(f21,plain,
( ~ spl2_2
| ~ spl2_1 ),
inference(avatar_split_clause,[],[f11,f13,f17]) ).
thf(f11,plain,
( ( ( ^ [Y0: a] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= sK0 )
| ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( ( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
| ( ( ^ [Y0: a] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= sK0 ) )
& ( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
| ( ( ^ [Y0: a] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= sK0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f8]) ).
thf(f8,plain,
( ? [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) ) )
| ( ( ^ [Y0: a] :
( ~ ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
!= X0 ) )
& ( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) ) )
| ( ( ^ [Y0: a] :
( ~ ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
= X0 ) ) )
=> ( ( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
| ( ( ^ [Y0: a] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
!= sK0 ) )
& ( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
| ( ( ^ [Y0: a] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= sK0 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
!= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) ) )
| ( ( ^ [Y0: a] :
( ~ ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
!= X0 ) )
& ( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) ) )
| ( ( ^ [Y0: a] :
( ~ ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
= X0 ) ) ),
inference(nnf_transformation,[],[f6]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o] :
( ( ( ^ [Y0: a] :
( ~ ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
= X0 )
<~> ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) ) )
<=> ( ( ^ [Y0: a] :
( ~ ( X1 @ Y0 )
& ( X0 @ Y0 ) ) )
= X0 ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ( ( ^ [X2: a] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) )
= ( ^ [X3: a] : $false ) )
<=> ( ( ^ [X4: a] :
( ( X0 @ X4 )
& ~ ( X1 @ X4 ) ) )
= X0 ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o] :
( ( ( ^ [X2: a] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) )
= ( ^ [X2: a] : $false ) )
<=> ( ( ^ [X2: a] :
( ( X0 @ X2 )
& ~ ( X1 @ X2 ) ) )
= X0 ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o] :
( ( ( ^ [X2: a] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) )
= ( ^ [X2: a] : $false ) )
<=> ( ( ^ [X2: a] :
( ( X0 @ X2 )
& ~ ( X1 @ X2 ) ) )
= X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_84_pme) ).
thf(f20,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f10,f17,f13]) ).
thf(f10,plain,
( ( ( ^ [Y0: a] : $false )
= ( ^ [Y0: a] :
( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) )
| ( ( ^ [Y0: a] :
( ~ ( sK1 @ Y0 )
& ( sK0 @ Y0 ) ) )
= sK0 ) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : SET611^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.35 % Computer : n026.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Mon May 20 12:47:38 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.12/0.35 This is a TH0_THM_EQU_NAR problem
% 0.12/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.37 % (32084)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (3000ds/4Mi)
% 0.19/0.37 % (32088)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (3000ds/275Mi)
% 0.19/0.37 % (32086)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.19/0.37 % (32087)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.19/0.37 % (32085)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (3000ds/27Mi)
% 0.19/0.37 % (32090)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.19/0.37 % (32089)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.19/0.37 % (32086)Instruction limit reached!
% 0.19/0.37 % (32086)------------------------------
% 0.19/0.37 % (32086)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37 % (32086)Termination reason: Unknown
% 0.19/0.37 % (32086)Termination phase: Property scanning
% 0.19/0.37
% 0.19/0.37 % (32086)Memory used [KB]: 895
% 0.19/0.37 % (32087)Instruction limit reached!
% 0.19/0.37 % (32087)------------------------------
% 0.19/0.37 % (32087)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37 % (32087)Termination reason: Unknown
% 0.19/0.37 % (32087)Termination phase: Saturation
% 0.19/0.37
% 0.19/0.37 % (32087)Memory used [KB]: 895
% 0.19/0.37 % (32087)Time elapsed: 0.002 s
% 0.19/0.37 % (32087)Instructions burned: 2 (million)
% 0.19/0.37 % (32087)------------------------------
% 0.19/0.37 % (32087)------------------------------
% 0.19/0.37 % (32086)Time elapsed: 0.002 s
% 0.19/0.37 % (32086)Instructions burned: 2 (million)
% 0.19/0.37 % (32086)------------------------------
% 0.19/0.37 % (32086)------------------------------
% 0.19/0.37 % (32090)Instruction limit reached!
% 0.19/0.37 % (32090)------------------------------
% 0.19/0.37 % (32090)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37 % (32090)Termination reason: Unknown
% 0.19/0.37 % (32090)Termination phase: Saturation
% 0.19/0.37
% 0.19/0.37 % (32090)Memory used [KB]: 5500
% 0.19/0.37 % (32090)Time elapsed: 0.003 s
% 0.19/0.37 % (32090)Instructions burned: 3 (million)
% 0.19/0.37 % (32090)------------------------------
% 0.19/0.37 % (32090)------------------------------
% 0.19/0.37 % (32088)First to succeed.
% 0.19/0.37 % (32084)Instruction limit reached!
% 0.19/0.37 % (32084)------------------------------
% 0.19/0.37 % (32084)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37 % (32084)Termination reason: Unknown
% 0.19/0.37 % (32084)Termination phase: Saturation
% 0.19/0.37
% 0.19/0.37 % (32084)Memory used [KB]: 5500
% 0.19/0.37 % (32084)Time elapsed: 0.005 s
% 0.19/0.37 % (32084)Instructions burned: 5 (million)
% 0.19/0.37 % (32084)------------------------------
% 0.19/0.37 % (32084)------------------------------
% 0.19/0.37 % (32083)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.19/0.37 % (32085)Also succeeded, but the first one will report.
% 0.19/0.37 % (32089)Also succeeded, but the first one will report.
% 0.19/0.37 % (32088)Refutation found. Thanks to Tanya!
% 0.19/0.37 % SZS status Theorem for theBenchmark
% 0.19/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.37 % (32088)------------------------------
% 0.19/0.37 % (32088)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37 % (32088)Termination reason: Refutation
% 0.19/0.37
% 0.19/0.37 % (32088)Memory used [KB]: 5500
% 0.19/0.37 % (32088)Time elapsed: 0.005 s
% 0.19/0.37 % (32088)Instructions burned: 3 (million)
% 0.19/0.37 % (32088)------------------------------
% 0.19/0.37 % (32088)------------------------------
% 0.19/0.37 % (32082)Success in time 0.015 s
% 0.19/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------